[20260130] BOJ / G5 / 개똥벌레 / 김민진 #1860
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
개똥벌레
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
동굴에 석순과 종유석이 번갈아가면서 나타남
개똥벌레가 동굴을 지나갈 때 파괴해야하는 석순과 종유석 수가 가장 적은 경우에 몇 개를 파괴해야하는지와 그 구간의 수는?
🔍 풀이 방법
누적합
석순은 밑에서부터, 종유석은 위에서부터 자라니까 배열을 두 개 두고 석순은 역방향으로 누적합, 종유석은 정방향으로 누적합
두 개의 배열을 순회하면서 누적합의 합의 최솟값 업데이트 및 최솟값 갯수 카운트
⏳ 회고
역방향으로도 누적합을 진행하니까 패딩을 양 옆에 두 개 두기